منابع مشابه
Randomness-Efficient Sampling within NC
We construct a randomness-efficient averaging sampler that is computable by uniform constantdepth circuits with parity gates (i.e., in uniform AC0[⊕]). Our sampler matches the parameters achieved by random walks on constant-degree expander graphs, allowing us to apply a variety expander-based techniques within NC. For example, we obtain the following results: • Randomness-efficient error-reduct...
متن کاملRandomness-efficient Curve Sampling
Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the s...
متن کاملAn Investigation of Sources of Randomness Within Discrete Gaussian Sampling
This paper presents a performance and statistical analysis of random number generators and discrete Gaussian samplers implemented in software. Most Lattice-based cryptographic schemes utilise discrete Gaussian sampling and will require a quality random source. We examine a range of candidates for this purpose, including NIST DRBGs, stream ciphers and well-known PRNGs. The performance of these r...
متن کاملRandomness-optimal oblivious sampling
We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any α > 0, it uses (1 +α)(m+ log γ−1) random bits to output d = poly( −1, log γ−1,m) sample points z1, . . . , zd ∈ {0, 1} such that for any function f : {0, 1} → [0, 1], Pr [ ∣∣∣ 1 d ∑di=1f(zi)−Ef ∣∣∣ ≤ ] ≥ 1− γ. Our proof is based on ...
متن کاملRandomness Efficient Steganography
Steganographic protocols enables one to “embed” covert messages into inconspicuous data over a public communication channel in such a way that no one, aside from the sender and the intended receiver can even detect the presence of the secret message. In this paper, we provide a new provably-secure, private-key steganographic encryption protocol. We prove the security of our protocol in the comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2008
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-007-0238-5